On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
نویسندگان
چکیده
We show that any 2−factor of a cubic graph can be extended to a maximum 3−edge-colorable subgraph. We also show that the sum of sizes of maximum 2− and 3−edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices.
منابع مشابه
Maximum Δ-edge-colorable subgraphs of class II graphs
A graph G is class II, if its chromatic index is at least ∆ + 1. Let H be a maximum ∆-edge-colorable subgraph of G. The paper proves best possible lower bounds for |E(H)| |E(G)| , and structural properties of maximum ∆-edge-colorable subgraphs. It is shown that every set of vertex-disjoint cycles of a class II graph with ∆ ≥ 3 can be extended to a maximum ∆-edge-colorable subgraph. Simple graph...
متن کاملOn Minimal Non-(2,1)-Colorable Graphs
A graph is (2, 1)-colorable if it allows a partition of its vertices into two classes such that both induce graphs with maximum degree at most one. A non-(2, 1)-colorable graph is minimal if all proper subgraphs are (2, 1)colorable. We prove that such graphs are 2-edge-connected and that every edge sits in an odd cycle. Furthermore, we show properties of edge cuts and particular graphs which ar...
متن کاملA note on Berge-Fulkerson coloring
The Berge–Fulkerson Conjecture states that every cubic bridgeless graph has six perfect matchings such that every edge of the graph is contained in exactly two of these perfect matchings. In this paper, a useful technical lemma is proved that a cubic graph G admits a Berge–Fulkerson coloring if and only if the graph G contains a pair of edge-disjoint matchings M1 and M2 such that (i) M1 ∪ M2 in...
متن کاملApproximating the Maximum 3- and 4-Edge-Colorable Subgraph
We study large k-edge-colorable subgraphs of simple graphs and multigraphs. We show that: – every simple subcubic graph G has a 3-edge-colorable subgraph (3ECS) with at least 13 15 |E(G)| edges, unless G is isomorphic to K4 with one edge subdivided, – every subcubic multigraph G has a 3-ECS with at least 7 9 |E(G)| edges, unless G is isomorphic to K3 with one edge doubled, – every simple graph ...
متن کاملOn S-packing edge-colorings of cubic graphs
Given a non-decreasing sequence S = (s1, s2, . . . , sk) of positive integers, an Spacking edge-coloring of a graph G is a partition of the edge set of G into k subsets {X1,X2, . . . ,Xk} such that for each 1 ≤ i ≤ k, the distance between two distinct edges e, e′ ∈ Xi is at least si + 1. This paper studies S-packing edgecolorings of cubic graphs. Among other results, we prove that cubic graphs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 172 شماره
صفحات -
تاریخ انتشار 2014